Guesteditors'introduction:Specialissueon Structural Operational Semantics
نویسندگان
چکیده
منابع مشابه
Modular structural operational semantics
Modular SOS (MSOS) is a variant of conventional Structural Operational Semantics (SOS). Using MSOS, the transition rules for each construct of a programming language can be given definitively, once and for all, and do not need reformulation when further constructs are added to the language. MSOS thus provides an exceptionally high degree of modularity in language descriptions, thereby removing ...
متن کاملStructuring Structural Operational Semantics
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملDynamic Structural Operational Semantics
We introduce Dynamic SOS as a framework for describing semantics of programming languages that include dynamic software upgrades. Dynamic SOS (DSOS) is built on top of the Modular SOS of P. Mosses, with an underlying category theory formalization. The idea of Dynamic SOS is to bring out the essential differences between dynamic upgrade constructs and program execution constructs. The important ...
متن کاملStructural Congruences and Structural Operational Semantics
Structural congruences have been used to define the semantics and to capture inherent properties of language constructs. They have been used as an addendum to transition system specifications in Plotkin’s style of Structural Operational Semantics (SOS). However, there has been little theoretical work on establishing a formal link between theses two semantic specification frameworks. In this pap...
متن کاملName-passing process calculi : operational models and structural operational semantics
rule induction. Together, an abstract rule of this form and a U-structured B-coalgebra, (X ,h : UX → BUX ), provide parameterised recursion data (C ,Σ,T,UX ,BU T̃X , fρ,X , gX ,h) where the morphisms fρ,X , gX ,h are defined as follows. fρ,X = Σ(TUX × BU T̃X ) Σ(uX×... ) −−−−−→ Σ(UT̃X × BU T̃X ) ρ T̃ X −→ BU T̃ T̃ X BUμ̃X −→ BU T̃X gX ,h = UX h −→ BUX BUη̃X −−−→ BU T̃X . (6.2.12) Hence an abstract rule ρ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2004
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2004.03.010